Incarnation in Ludics and maximal cliques of paths
نویسندگان
چکیده
منابع مشابه
Incarnation in Ludics and maximal cliques of paths
Ludics is a reconstruction of logic with interaction as a primitive notion, in the sense that the primary logical concepts are no more formulas and proofs but cut-elimination interpreted as an interaction between objects called designs. When the interaction between two designs goes well, such two designs are said to be orthogonal. A behaviour is a set of designs closed under bi-orthogonality. L...
متن کاملInvariant Maximal Cliques and Incompleteness
The Invariant Maximal Clique Theorem asserts that every graph on Q[0,n] with a specific invariance condition has a maximal clique with another specific invariance condition. Here Q[0,n] consists of the rationals in the interval [0,n]. The invariance conditions are all given by equivalence relations involving only < on [0,n] and the distinguished elements 1,...,n. We prove the Invariant Maximal ...
متن کاملEquations , Maximal Cliques , and Graph Isomorphism
We present a new energy-minimization framework for the graph isomorphism problem which is based on an equivalent maximum clique formulation. The approach is centered around a fundamental result proved by Motzkin and Straus in the mid-1960s, and recently expanded in various ways, which allows us to formulate the maximum clique problem in terms of a standard quadratic program. The attractive feat...
متن کاملComputing maximal cliques in link streams
A link stream is a collection of triplets (t, u, v) indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to such link streams: for a given ∆, a ∆-clique is a set of nodes and a time interval such that all pairs of nodes in this set interact at least once during each sub-interval of duration ∆. We propose an algorithm to enume...
متن کاملFinding All Maximal Cliques in Dynamic Graphs
Clustering applications dealing with perception based or biased data lead to models with non-disjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maximal cliques in dynamic graphs like Gt = (V,Et), where Et−1 ⊂ Et, t = 1, . . . , T ;E0 = φ. In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2013
ISSN: 1860-5974
DOI: 10.2168/lmcs-9(4:6)2013